Distributionally Robust Optimization of Two‐Stage Lot‐Sizing Problems
نویسندگان
چکیده
منابع مشابه
Distributionally Robust Convex Optimization
Distributionally robust optimization is a paradigm for decision-making under uncertaintywhere the uncertain problem data is governed by a probability distribution that is itself subjectto uncertainty. The distribution is then assumed to belong to an ambiguity set comprising alldistributions that are compatible with the decision maker’s prior information. In this paper,we propose...
متن کاملConvergence Analysis for Distributionally Robust Optimization and Equilibrium Problems
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملCalibration of Distributionally Robust Empirical Optimization Models
JUN-YA GOTOH, MICHAEL JONG KIM, AND ANDREW E.B. LIM Department of Industrial and Systems Engineering, Chuo University, Tokyo, Japan. Email: [email protected] Sauder School of Business, University of British Columbia, Vancouver, Canada. Email: [email protected] Departments of Decision Sciences and Finance, NUS Business School, National University of Singapore, Singapore. Email: andr...
متن کاملDistributionally Robust Optimization for Sequential Decision Making
The distributionally robust Markov Decision Process approach has been proposed in the literature, where the goal is to seek a distributionally robust policy that achieves the maximal expected total reward under the most adversarial joint distribution of uncertain parameters. In this paper, we study distributionally robust MDP where ambiguity sets for uncertain parameters are of a format that ca...
متن کاملData-driven Distributionally Robust Polynomial Optimization
We consider robust optimization for polynomial optimization problems where the uncertainty set is a set of candidate probability density functions. This set is a ball around a density function estimated from data samples, i.e., it is data-driven and random. Polynomial optimization problems are inherently hard due to nonconvex objectives and constraints. However, we show that by employing polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Production and Operations Management
سال: 2016
ISSN: 1059-1478,1937-5956
DOI: 10.1111/poms.12602